Simple Approximations of Semialgebraic Sets and their Applications to Control

نویسندگان

  • Fabrizio Dabbene
  • Didier Henrion
  • Constantino M. Lagoa
چکیده

Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance the solution set of linear matrix inequalities or the Schur/Hurwitz stability domains. These sets often have very complicated shapes (non-convex, and even non-connected), which renders very difficult their manipulation. It is therefore of considerable importance to find simple-enough approximations of these sets, able to capture their main characteristics while maintaining a low level of complexity. For these reasons, in the past years several convex approximations, based for instance on hyperrectangles, polytopes, or ellipsoids have been proposed. In this work, we move a step further, and propose possibly non-convex approximations, based on a small volume polynomial superlevel set of a single positive polynomial of given degree. We show how these sets can be easily approximated by minimizing the L1 norm of the polynomial over the semialgebraic set, subject to positivity constraints. Intuitively, this corresponds to the trace minimization heuristic commonly encounter in minimum volume ellipsoid problems. From a computational viewpoint, we design a hierarchy of linear matrix inequality problems to generate these approximations, and we provide theoretically rigorous convergence results, in the sense that the hierarchy of outer approximations converges in volume (or, equivalently, almost everywhere and almost uniformly) to the original set. Two main applications of the proposed approach are considered. The first one aims at reconstruction/approximation of sets from a finite number of samples. In the second one, we show how the concept of polynomial superlevel set can be used to generate samples uniformly distributed on a given semialgebraic set. The efficiency of the proposed approach is demonstrated by different numerical examples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix Convex Hulls of Free Semialgebraic Sets

This article resides in the realm of the noncommutative (free) analog of real algebraic geometry – the study of polynomial inequalities and equations over the real numbers – with a focus on matrix convex sets C and their projections Ĉ. A free semialgebraic set which is convex as well as bounded and open can be represented as the solution set of a Linear Matrix Inequality (LMI), a result which s...

متن کامل

استفاده از الگوریتم ژنتیک در مسائل کوتاهترین مسیر چند معیاره بر پایه سیستمهای اطلاعات مکانی

Multi-criteria shortest path problems (MSPP) are called as NP-Hard. For MSPPs, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. Algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. This paper describes the development ...

متن کامل

Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design

We describe an elementary algorithm to build convex inner approximations of nonconvex sets. Both input and output sets are basic semialgebraic sets given as lists of defining multivariate polynomials. Even though no optimality guarantees can be given (e.g. in terms of volume maximization for bounded sets), the algorithm is designed to preserve convex boundaries as much as possible, while removi...

متن کامل

Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets

Given a compact semialgebraic set S ⊆ R, a polynomial map f : S → R, we consider the problem of approximating the image set F = f(S). This includes in particular the projections of S on R, for n ≥ m. Assuming that F ⊆ B, with B ⊆ R being a “simple” set (box or ellipsoid), we provide two methods (called Method 1 and Method 2) to compute certified outer approximations of F : — The first approach ...

متن کامل

INDEPENDENT SETS OF SOME GRAPHS ASSOCIATED TO COMMUTATIVE RINGS

Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$,  if no two vertices of $S$ are adjacent.The  independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Automatica

دوره 78  شماره 

صفحات  -

تاریخ انتشار 2017